Explicit Enumeration of Triangulations with Multiple Boundaries
نویسنده
چکیده
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.
منابع مشابه
Efficient enumeration of 3-manifold triangulations
Triangulations describe how different low-dimensional topological spaces can be constructed from simple building blocks. Forming an exhaustive list of all small triangulations is difficult, typically involving a slow computer-based search. We present techniques for improving the efficiency of such searches, thereby allowing more extensive lists to be constructed.
متن کاملEnumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points
We propose algorithms to enumerate (1) classes of regular triangulations in respect of symmetry for products of two simplices and (2) all triangulations, regular or not, for arbitrary con gurations of points. There are many results for triangulations in two dimension, but little is known for higher dimensions. Both objects we enumerate in this paper are for general dimensions. Products of two s...
متن کاملAn e cient algorithm for enumeration of triangulations
We consider the problem of enumerating triangulations of n points in the plane in general position. We introduce a tree of triangulations and present an algorithm for enumerating triangulations in O(log log n) time per triangulation. It improves the previous bound by almost linear factor.
متن کاملCounting Colored Random Triangulations
We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to the enumeration of decorated trees. We give a direct combinatorial derivation of the associated counting function, involving tricolored trees. This is gener...
متن کاملBijections for Maps with Boundaries: Krikun’s Formula for Triangulations, and a Quadrangulation Analogue
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized formula obtained by Krikun using a (technically involved) generating function approach. The analogous formula for quadrangulations is new. Our method is to sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007